Origins of the Calculus of Binary Relations
نویسنده
چکیده
The calculus of binary relations was introduced by De Morgan in 1860, and was subsequently greatly developed by Peirce and Schröder. Half a century later Tarski, Jónsson, Lyndon, and Monk further developed the calculus from the perspective of modern model theory.
منابع مشابه
Fuzzy number-valued fuzzy relation
It is well known fact that binary relations are generalized mathematical functions. Contrary to functions from domain to range, binary relations may assign to each element of domain two or more elements of range. Some basic operations on functions such as the inverse and composition are applicable to binary relations as well. Depending on the domain or range or both are fuzzy value fuzzy set, i...
متن کاملSimilarity DH-Algebras
In cite{GL}, B. Gerla and I. Leuc{s}tean introduced the notion of similarity on MV-algebra. A similarity MV-algebra is an MV-algebra endowed with a binary operation $S$ that verifies certain additional properties. Also, Chirtec{s} in cite{C}, study the notion of similarity on L ukasiewicz-Moisil algebras. In particular, strong similarity L ukasiewicz-Moisil algebras were defined. In this paper...
متن کاملThe Second Calculus of Binary Relations
We view the Chu space interpretation of linear logic as an alternative interpretation of the language of the Peirce calculus of binary relations. Chu spaces amount to K-valued binary relations, which for K = 2 we show generalize n-ary relational structures. We also exhibit a four-stage unique factorization system for Chu transforms that illuminates their op-
متن کاملA Complete Natural Deduction System for the Relational Calculus
A relational calculus is a formal system in which relation is the fundamental concept. The simplest relational calculus, that of ordinary binary relations, was introduced by Tarski in [4]. Tarski’s system is essentially an algebra in which the operations are the usual Boolean operations (on sets of ordered pairs) together with the two special operations converse (denoted byq) and composition (d...
متن کاملPositive Reducts of Relevance Logic and Algebras of Binary Relations
We prove that algebras of binary relations whose similarity type includes intersection, union, and one of the residuals of relation composition form a non-finitely axiomatizable quasivariety and that the equational theory is not finitely based. We apply this result to the problem of the completeness of the positive fragment of relevance logic with respect to binary relations.
متن کامل